Formulation of general possibilistic linear programming problems for complex industrial systems

The current models and methods for PLP are usually restricted on some special types and usually the same type of possibilistic distribution. This paper focuses on linear programming problems with general possibilistic resources (GRPLP) and linear programming problems with general possibilistic objective coe cients (GOPLP). By introducing some new concepts of the largest most possible point, the smallest most possible point, the most optimistic point and the most possible decision, a new approach for formulating possibilistic constraints through general possibilistic resources and a satisfactory solution method will be discussed in this paper. A most possible decision method for GRPLP and a dual approach for GOPLP will be proposed for solving complex industrial decision problems. c © 2001 Elsevier Science B.V. All rights reserved.